Computability logic - PDFSEARCH.IO - Document Search Engine

Computability logic
Results: 552

#	Item
421	Chapter 9 Rewriting Nachum Dershowitz David A. Plaisted Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2005-03-20 12:18:38 Applied mathematics Logic in computer science Mathematical logic Rewriting Computability theory Semi-Thue system Differential equation Normal form Linear equation Theoretical computer science Mathematics Formal languages
422	The Dierential Lambda-Calculus Thomas Ehrhard and Laurent Regnier Institut de Mathématiques de Luminy, C.N.R.S. U.P.R[removed]removed] Add to Reading List Source URL: iml.univ-mrs.fr Language: English - Date: 2001-05-31 09:45:10 Computability theory Lambda calculus Theoretical computer science Derivative Chain rule Integration by substitution State space Combinatory logic Heat equation Calculus Mathematical analysis Mathematics
423	RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:59:20 Logic Theory of computation Congruence lattice problem Mathematics Computability theory Forcing
424	ERRATA FOR “ON THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS” PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND THEODORE A. SLAMAN Several proofs given in [2] contain significant errors or gaps, although Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-08-16 22:19:13 Year of birth missing Turing degree Mathematics Mathematical logic Logic Proof theory Computability theory Carl Jockusch Place of birth missing
425	THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverse Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:55:43 Mathematics Theory of computation PA degree Computable function Reverse mathematics Model theory Forcing Combinatory logic Primitive recursive function Computability theory Mathematical logic Theoretical computer science
426	On Self-Embeddings of Computable Linear Orderings ? Rodney G. Downey a , Carl Jockusch b and Joseph S. Miller a a School of Mathematical and Computing Sciences Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:54:43 Mathematical logic Theory of computation Computable function Halting problem Turing reduction Reverse mathematics Embedding Ordinal number Computability theory Mathematics Theoretical computer science
427	Questions in Recursion Theory December 1997 This is an informal list of some open problems in recursion theory. Solutions and new questions are welcome, as well as corrections to the attributions given below. Please, sen Add to Reading List Source URL: math.berkeley.edu Language: English - Date: 2002-11-21 07:33:52 Mathematics Recursively enumerable set Turing degree Maximal set Creative and productive sets Simple set Low High Recursive set Computability theory Theoretical computer science Mathematical logic
428	Computers, Paradoxes and the Foundations of Mathematics Some great thinkers of the 20th century have shown that even in the austere world of mathematics, incompleteness and randomness are rife Gregory J. Chaitin Add to Reading List Source URL: www.umcs.maine.edu Language: English - Date: 2002-02-07 17:02:09 Mathematical logic Computability theory Philosophy of mathematics Theoretical computer science Formal systems Kurt Gödel Halting problem Kolmogorov complexity Algorithmic information theory Mathematics Logic Science
429	CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show t Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:58:40 Order theory Computability theory Integer sequences Antichain Functions and mappings Computable function Tree Function Model theory Mathematics Mathematical logic Theory of computation
430	THE PROFESSION We Are Sorry to Inform You … Simone Santini, University of California, San Diego Add to Reading List Source URL: th.informatik.uni-mannheim.de Language: English - Date: 2006-02-23 13:30:56 Theoretical computer science Models of computation Turing machine Computability theory Algorithm Mathematical logic Computer Goto Fortran Computing Software engineering Computer programming

UPDATE